Welcome to the InfoSci Platform
Lossless Compression of Semi-Ordered Trees

Lossless Compression of Semi-Ordered Trees

Habibeche Salah eddine, Ben-Naoum Farah
Copyright: © 2022 |Volume: 12 |Issue: 1 |Pages: 21
ISSN: 2640-0324|EISSN: 2640-0332|EISBN13: 9781683183624|DOI: 10.4018/IJARB.290341
Cite Article Cite Article

MLA

Habibeche Salah eddine, and Ben-Naoum Farah. "Lossless Compression of Semi-Ordered Trees." IJARB vol.12, no.1 2022: pp.1-21. http://doi.org/10.4018/IJARB.290341

APA

Habibeche Salah eddine & Farah, B. (2022). Lossless Compression of Semi-Ordered Trees. International Journal of Applied Research in Bioinformatics (IJARB), 12(1), 1-21. http://doi.org/10.4018/IJARB.290341

Chicago

Habibeche Salah eddine, and Ben-Naoum Farah. "Lossless Compression of Semi-Ordered Trees," International Journal of Applied Research in Bioinformatics (IJARB) 12, no.1: 1-21. http://doi.org/10.4018/IJARB.290341

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, authors are interested in the problem of lossless compression of unlabeled semi-ordered trees. Semi-ordered trees are a class of trees that present an order between some sibling while some other sibling are unordered. They offer a wide possibility of applications especially for the representation of plants architecture. Authors show that these trees present remarkable compression properties covering those of ordered and unordered trees. To illustrate this approach, authors apply these notions to a particular class of semi-ordered trees which is the most studied branching structure particularly for a botanical motivation, namely axial trees.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.